'Weak Dependency Graph [60.0]'
------------------------------
Answer:           YES(?,O(1))
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  not(x) -> xor(x, true())
     , implies(x, y) -> xor(and(x, y), xor(x, true()))
     , or(x, y) -> xor(and(x, y), xor(x, y))
     , =(x, y) -> xor(x, xor(y, true()))}

Details:         
  We have computed the following set of weak (innermost) dependency pairs:
   {  not^#(x) -> c_0()
    , implies^#(x, y) -> c_1()
    , or^#(x, y) -> c_2()
    , =^#(x, y) -> c_3()}
  
  The usable rules are:
   {}
  
  The dependency graph contains no edges.
  
  We are done: the estimated dependency graph contains no edges and moreover, the usable rules are empty.